Homotopy algorithm for l 1 ‐norm minimisation problems
نویسندگان
چکیده
منابع مشابه
Dual periodicity in l1-norm minimisation problems
The topic of this paper is the discrete-time l1-norm minimisation problem with convolution constraints. We find primal initial conditions for which the dual optimal solution is periodic. Periodicity of the dual optimal solution implies satisfaction of a simple linear recurrence relation by the primal optimal solution. c © 2007 Elsevier B.V. All rights reserved.
متن کاملSignal Identiication Using a Least L 1 Norm Algorithm
errors, and are essentially independent of the 25 larger errors. This is shown clearly by the fact that the SNTLN1 solution is changed only slightly byachange in .I n contrast, the VarPro solution nal error is determined primarily by the largest data errors, and will increase in proportion to ,a s is increased. This will also be true for any approximation method based on L 2 norm minimization. ...
متن کاملDecomposable norm minimization with proximal-gradient homotopy algorithm
We study the convergence rate of the proximal-gradient homotopy algorithm applied to normregularized linear least squares problems, for a general class of norms. The homotopy algorithm reduces the regularization parameter in a series of steps, and uses a proximal-gradient algorithm to solve the problem at each step. Proximal-gradient algorithm has a linear rate of convergence given that the obj...
متن کاملA Homotopy-Based Algorithm for Mixed Complementarity Problems
This paper develops an algorithm for solving mixed complementarity problems which is based upon probability one homotopy methods. After the complementarity problem is reformulated as a system of nonsmooth equations, a homotopy method is used to solve a sequence of smooth approximations to this system of equations. The global convergence properties of this approach are considerably stronger than...
متن کاملHomotopy-determinant Algorithm for Solving Nonsymmetric Eigenvalue Problems
The eigenvalues of a matrix A are the zeros of its characteristic polynomial fiX) = dtt[A XI]. With Hyman's method of determinant evaluation, a new homotopy continuation method, homotopy-determinant method, is developed in this paper for finding all eigenvalues of a real upper Hessenberg matrix. In contrast to other homotopy continuation methods, the homotopy-determinant method calculates eigen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IET Signal Processing
سال: 2015
ISSN: 1751-9675,1751-9683
DOI: 10.1049/iet-spr.2013.0338